Borel-type bounds for the self-avoiding walk connective constant
نویسندگان
چکیده
منابع مشابه
Borel type bounds for the self-avoiding walk connective constant
Let µ be the self-avoiding walk connective constant on Z d. We show that the asymptotic expansion for β c = 1/µ in powers of 1/(2d) satisfies Borel type bounds. This supports the conjecture that the expansion is Borel summable.
متن کاملNew Lower Bounds on the Self-Avoiding-Walk Connective Constant
We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice Zd. The method is based on loop erasure and restoration, and does not require exact enumeration data. Our bounds are best for high d, and in fact agree with the rst four terms of the 1=d expansion for the connective constant. The bounds are the best t...
متن کاملImproved lower bounds on the connective constants for self-avoiding walks
We calculate improved lower bounds for the connective constants for selfavoiding walks on the square, hexagonal, triangular, (4.8), and (3.12) lattices. The bound is found by Kesten’s method of irreducible bridges. This involves using transfermatrix techniques to exactly enumerate the number of bridges of a given span to very many steps. Upper bounds are obtained from recent exact enumeration d...
متن کاملImproved lower bounds on the connective constants for two-dimensional self-avoiding walks
We calculate improved lower bounds for the connective constants for selfavoiding walks on the square, hexagonal, triangular, (4.82) and (3.122) lattices. The bound is found by Kesten’s method of irreducible bridges. This involves using transfer-matrix techniques to exactly enumerate the number of bridges of a given span to very many steps. Upper bounds are obtained from recent exact enumeration...
متن کاملNew Upper Bounds for the Connective Constants of Self-avoiding Walks
Using a novel implementation of the Goulden-Jackson method, we compute new upper bounds for the connective constants of self-avoiding walks, breaking Alm's previous records for rectangular (hypercubic) lattices. We also give the explicit generating functions for memory 8. The new upper bounds are 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2010
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/43/23/235001